Privacy preserving biometrics using partially homomorphic encryption
نویسنده
چکیده
We will look into privacy preserving biometrics using the example of a fingerprint reader and partially homomorphic encryption. Therefore we will cover the basics necessary to understand the discussed subject, partially homomorphic encryption and fingerprint based authentication, as well as showing a concrete protocol and its implications on performance and security of the system. While security will remain the same, speed is heavily reduced and bandwidth increased compared to the unprotected protocol. We will see to which problems homomorphic encryption presents a solution and which have to be solved differently.
منابع مشابه
Erratum: “Customisation of Paillier Homomorphic Encryption for Efficient Binary Biometric Feature Vector Matching” does NOT enable Privacy-Preserving Matching
A privacy-preserving biometric matching technique for binary vectors more efficient than the Goldwasser-Micali approach has been proposed in “Customisation of Paillier Homomorphic Encryption for Efficient Binary Biometric Feature Vector Matching [PPRU14]” based on exploiting Paillier’s capability of encrypting messages larger than one bit at a time. We demonstrate that the suggested solution do...
متن کاملPrivacy-preserving Distributed Analytics: Addressing the Privacy-Utility Tradeoff Using Homomorphic Encryption for Peer-to-Peer Analytics
Data is becoming increasingly valuable, but concerns over its security and privacy have limited its utility in analytics. Researchers and practitioners are constantly facing a privacy-utility tradeoff where addressing the former is often at the cost of the data utility and accuracy. In this paper, we draw upon mathematical properties of partially homomorphic encryption, a form of asymmetric key...
متن کاملIntroduction to Homomorphic Encryption
Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe h...
متن کاملPrivacy-Preserving Clustering Using Representatives over Arbitrarily Partitioned Data∗
The challenge in privacy-preserving data mining is avoiding the invasion of personal data privacy. Secure computation provides a solution to this problem. With the development of this technique, fully homomorphic encryption has been realized after decades of research; this encryption enables the computing and obtaining results via encrypted data without accessing any plaintext or private key in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013